A probabilistic analysis of some tree algorithms
نویسندگان
چکیده
منابع مشابه
A Probabilistic Analysis of Some Tree Algorithms
Abstract. In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to complex analysis techniques as it is usually the case. This approach gives a unified probabilistic treatment of these questions. ...
متن کاملA Probabilistic Analysis of Some Tree Algorithms
INRIA In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and ex...
متن کاملOn some conditioning results in the probabilistic analysis of algorithms
A key step in the probabilistic analysis of combinatorial algorithms is often that of establishing that certain conditioning introduced by the operation so far of the algorithm either helps or at least does not hurt too much. In this note we consider a conditioning problem that arises from searching adjacency lists, and which occurs for example in the analysis of algorithms for finding Hamilton...
متن کاملProbabilistic Analysis of Algorithms
Rather than analyzing the worst case performance of algorithms, one can investigate their performance on typical instances of a given size. This is the approach we investigate in this paper. Of course, the first question we must answer is: what do we mean by a typical instance of a given size? Sometimes, there is a natural answer to this question. For example, in developing an algorithm which i...
متن کاملProbabilistic Analysis of Tree Search
Consider the family tree of an age-dependent branching process, where the branches have costs corresponding to birth times. The first-birth problem of Hammersley (1974) then concerns the cost of an optimal (cheapest) node at depth n. Suppose that we must explore the tree so as to find an optimal or nearly optimal node at depth n. We now have a suitable model for analysing the behaviour of tree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2005
ISSN: 1050-5164
DOI: 10.1214/105051605000000494